A Reliable Task Scheduling Scheme For Sensor-based Real-time Operating System
نویسندگان
چکیده
The emergence of wireless networked sensors constitutes a hot research topic in embedded system design. Although system resource is seriously limited, operating system applied in sensors has to implement complex task scheduling, which should support concurrent operations, real-time constraint, adaptability and reliability. In this paper, we present a reliable OS scheduling scheme for wireless networked sensors. According to the analysis of operating model and task set of wireless networked sensors, a primary and subordinate two-level task-scheduling scheme is implemented to schedule time-critical and non-time-critical tasks, and an admission control policy is employed to meet hard real-time requirement of some real-time tasks. Furthermore, based on this scheme, some fault tolerance strategies are outlined to improve reliability at run time, including fault tolerance analysis, admission control based on fault tolerance, fault detection, and fault recovery. Key-Words: scheduling scheme, real-time, wireless network sensor, fault tolerance
منابع مشابه
Task & Resource Self-adaptive Embedded Real-time Operating System Microkernel for Wireless Sensor Nodes
Wireless Sensor Networks (WSNs) are used in many application fields, such as military, healthcare, environment surveillance, etc. The WSN OS based on event-driven model doesn’t support real-time and multi-task application types and the OSs based on thread-driven model consume much energy because of frequent context switch. Due to the high-dense and large-scale deployment of sensor nodes, it is ...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملOn Fixed Priority Preemptive Scheduling for Imprecise Computation
We present new results in fixed priority scheduling for imprecise computation in real-time systems. Imprecise computation has not been popularized enough for reasons which are rooted from the task model, scheduling methods (EDF-based) and general system support. Audsley et al. have devised schedulability tests for guaranteeing mandatory computation while incorporating unbounded optional compone...
متن کاملMultiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملDual-Mode r-Reliable Task Model for Flexible Scheduling in Reliable Real-Time Systems
Recent research in real-time systems has much focused on new task models for flexible scheduling and fault-tolerant real-time systems. In this paper, we propose a novel task model for the purpose of flexible scheduling in reliable real-time systems. In the proposed dualmode r-reliable task model, a task periodically releases fast mode jobs or reliable mode jobs with the constraint that reliable...
متن کامل